Deciding nonconstructibility of 3-balls with spanning edges and interior vertices
نویسنده
چکیده
Constructibility is a combinatorial property of simplicial complexes. In general, it requires a great deal of time to decide whether a simplicial complex is constructible or not. In this paper, we consider sufficient conditions for nonconstructibility of simplicial 3-balls to investigate efficient algorithms for the decision problem. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Deciding Constructibility of 3-balls with Few Interior Vertices
In this paper, we treat the decision problem of constructibility. This problem was solved only under the condition that the given simplicial complex is a triangulated 3-ball with all the vertices on the boundary 8]. Here we extend this result to the case that the triangulated 3-ball has at most two interior vertices.
متن کاملA survey of the studies on Gallai and anti-Gallai graphs
The Gallai graph and the anti-Gallai graph of a graph G are edge disjoint spanning subgraphs of the line graph L(G). The vertices in the Gallai graph are adjacent if two of the end vertices of the corresponding edges in G coincide and the other two end vertices are nonadjacent in G. The anti-Gallai graph of G is the complement of its Gallai graph in L(G). Attributed to Gallai (1967), the study ...
متن کاملPoly - Logarithmic Deterministic Fully - Dynamic GraphAlgorithms I : Connectivity and Minimum Spanning Tree
Deterministic fully dynamic graph algorithms are presented for con-nectivity and minimum spanning forest. For connectivity, starting with no edges, the amortized cost for maintaining a spanning forest is O(log 2 n) per update, i.e. per edge insertion or deletion. Deciding connectivity between any two given vertices is done in O(log n= log log n) time. This matches the previous best randomized b...
متن کاملShellability of Complexes of Trees
A very interesting abstract simplicial complex T (k) n has faces in bijection with the trees with at most n interior vertices, all of which have degrees at least k+2 and are congruent to 2 mod k, and whose leaves are labelled by the distinct integers in [0, 1, ..., m], where m+1 :=nk+2 is the number of leaves (n 0, k 1). Thus the facets of T n correspond to the leaf-labelled trees with n interi...
متن کاملRealizability of Graphs and Linkages
We show that deciding whether a graph with given edge lengths can be realized by a straight-line drawing has the same complexity as deciding the truth of sentences in the existential theory of the real numbers, ETR; we introduce the class ∃R that captures the computational complexity of ETR and many other problems. The graph realizability problem remains ∃R-complete if all edges have unit lengt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2007